Abelian square-free dithering for iterated hash functions
نویسنده
چکیده
We present a novel way of “dithering” the operation of an iterated hash function, based on the notion of square-free sequences (sequences containing no consecutive repeated subsequences) and on their generalization to abelian square-free sequences, as a means of defeating some “message expansion” attacks recently proposed by Dean and of Kelsey and Schneier [Dea99,KS05].
منابع مشابه
Security of Iterated Hash Functions Based on Block Ciphers
Cryptographic hash functions obtained by iterating a round function constructed from a block cipher and for which the hash-code length is twice the block length m of the underlying block cipher are considered. The computational security of such hash functions against two particular attacks, namely, the free-start target and free-start collision attacks, is investigated; these two attacks differ...
متن کاملBreaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today (including the MD and SHA families) have an iterated design, it is important to study the general security properties of such functions. At Crypto 2004 Joux showed that in any iterated hash function it is relatively e...
متن کاملNew Constructions of Universal Hash Functions Based on Function Sums
In this paper, we propose a generalization of the SQUARE hash function family to the function sum hash, which is based on functions with low maximal differential over arbitrary Abelian groups. These new variants allow the designer to construct SQUARE-like hash functions on different platforms for efficient and secure message authentication. A variant using functions with low algebraic degree ov...
متن کاملSecond Preimages for Iterated Hash Functions and Their Implications on MACs
In this article, we focus on second preimages for iterated hash functions. More precisely, we introduce the notion of a b-block bypass which is closely related to the notion of second preimage but specifies additional properties. We will then give two examples of iterated hash functions to which this notion applies: a double-block length hash function and a single-block length hash function. Fu...
متن کاملHash function security:cryptanalysis of the Very Smooth Hash and multicollisions in generalised iterated hash functions
In recent years, the amount of electronic communication has grown enormously. This has posed some new problems in information security. In particular, the methods in cryptography have been under much scrutiny. There are several basic primitives that modern cryptographic protocols utilise. One of these is hash functions, which are used to compute short hash values from messages of any length. In...
متن کامل